Rank-Pairing Heaps
نویسندگان
چکیده
We introduce the rank-pairing heap, a heap (priority queue) implementation that combines the asymptotic efficiency of Fibonacci heaps with much of the simplicity of pairing heaps. Unlike all other heap implementations that match the bounds of Fibonacci heaps, our structure needs only one cut and no other structural changes per key decrease; the trees representing the heap can evolve to have arbitrary structure. Our initial experiments indicate that rankpairing heaps perform almost as well as pairing heaps on typical input sequences and better on worst-case sequences.
منابع مشابه
Heaps Simplified
The heap is a basic data structure used in a wide variety of applications, including shortest path and minimum spanning tree algorithms. In this paper we explore the design space of comparison-based, amortized-efficient heap implementations. From a consideration of dynamic single-elimination tournaments, we obtain the binomial queue, a classical heap implementation, in a simple and natural way....
متن کاملRank-Relaxed Weak Queues: Faster than Pairing and Fibonacci Heaps?
A run-relaxed weak queue by Elmasry et al. (2005) is a priority queue data structure with insert and decrease-key in O(1) as well as delete and delete-min in O(log n) worst-case time. One further advantage is the small space consumption of 3n+O(log n) pointers. In this paper we propose rank-relaxed weak queues, reducing the number of rank violations nodes for each level to a constant, while pro...
متن کاملAn empirical analysis of algorithmsfor constructing a minimum spanning treeBernard
We compare algorithms for the construction of a minimum spanning tree through large-scale experimentation on randomly generated graphs of diierent structures and diierent densities. In order to extrapolate with conndence, we use graphs with up to 130,000 nodes (sparse) or 750,000 edges (dense). Algorithms included in our experiments are Prim's algorithm (implemented with a variety of priority q...
متن کاملPairing heaps: the forward variant
The pairing heap is a classical heap data structure introduced in 1986 by Fredman, Sedgewick, Sleator, and Tarjan. It is remarkable both for its simplicity and for its excellent performance in practice. The “magic” of pairing heaps lies in the restructuring that happens after the deletion of the smallest element. The resulting collection of trees is consolidated in two rounds: a left-to-right p...
متن کاملPairing Heaps are Sub - optimalbyMichael
Pairing heaps were introduced as a self-adjusting alternative to Fibonacci heaps. They provably enjoy log n amortized costs for the standard heap operations. Although it has not been veri ed that pairing heaps perform the decrease key operation in constant amortized time, this has been conjectured and extensive experimental evidence supports this conjecture. Moreover, pairing heaps have been ob...
متن کامل